. C C ] 1 1 A ug 2 00 6 Renormalization group approach to the P versus NP question
نویسنده
چکیده
This paper argues that the ideas underlying the renormalization group technique applicable to phase transitions in physical systems are useful in distinguishing computational complexity classes. The paper presents a renormalization group transformation that maps an arbitrary Boolean function of N Boolean variables to one of N − 1 variables and shows that when this transformation is applied repeatedly, the behavior of the resulting sequence of functions can be used to distinguish a generic Boolean function from a Boolean function that can be written as a polynomial of degree ξ with ξ ≪ N. It is shown that, if one plausible conjecture is true, the ability to distinguish these two classes of functions can enable one to determine that a given Boolean function cannot be computed using resources that are bounded by a polynomial of N .
منابع مشابه
ep - t h / 04 08 15 2 v 1 1 9 A ug 2 00 4 Summation of Higher Order Effects using the Renormalization Group Equation
متن کامل
A ug 2 00 1 Improving the Renormalization Group approach to the quantum - mechanical double well potential
The gap between ground and first excited state of the quantum-mechanical double well is calculated using the Renormalization Group equations to the second order in the derivative expansion, obtained within a class of proper time regulators. Agreement with the exact results is obtained both in the strong and weak coupling regime.
متن کاملar X iv : 0 80 5 . 21 70 v 4 [ cs . C C ] 2 1 M ay 2 00 8 Independence of P vs . NP in regards to oracle
Previously in “P is a proper subset of NP” [Meek Article 1, 2008] and “Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem” [Meek Article 2, 2008] the present author has demonstrated that some NP-complete problems are likely to have no deterministic polynomial time solution. In this article the concepts of these previous works will be applied to the relativizat...
متن کاملar X iv : 0 80 5 . 21 70 v 1 [ cs . C C ] 1 4 M ay 2 00 8 Independence of P vs . NP in regards to oracle
This is the third article in a series of four articles dealing with the P vs. NP question. The purpose of this work is to demonstrate that although the oracle relativizations of the NP complexity class eliminate some methods as possible routes to a solution, the methods used in the first two articles of this series are not affected by oracle relativizations. Furthermore, the solution to the P v...
متن کاملM ay 2 00 8 Independence of P vs . NP in regards to oracle
Previously in “P is a proper subset of NP” [Meek Article 1, 2008] and “Analysis of the Deterministic Polynomial Time Solvability of the 0-1-Knapsack Problem” [Meek Article 2, 2008] the present author has demonstrated that some NP-complete problems are likely to have no deterministic polynomial time solution. In this article the concepts of these previous works will be applied to the relativizat...
متن کامل